Implementing declarative overlays

Implementing Dynamic Querying Search in k-ary DHT-based Overlays

Distributed Hash Tables (DHTs) provide scalable mechanisms for implementing resource discovery services in structured Peer-to-Peer (P2P) networks. However, DHT-based lookups do not support some types of queries which are fundamental in several classes of applications. A way to support arbitrary queries in structured P2P networks is implementing unstructured search techniques on top of DHT-based...

Dyna: A Declarative Language for Implementing Dynamic Programs

We present the first version of a new declarative programming language. Dyna has many uses but was designed especially for rapid development of new statistical NLP systems. A Dyna program is a small set of equations, resembling Prolog inference rules, that specify the abstract structure of a dynamic programming algorithm. It compiles into efficient, portable, C++ classes that can be easily invo...

Implementing Level 4 Liveness in Declarative Visual Programming Languages

An increasingly common characteristic in visual programming languages (VPLs) is level 4 liveness—the constant monitoring of the system state with continuous redisplay as events arrive and computations progress. However, level 4 liveness can be expensive. In this paper, we present an implementation method that supports level 4 liveness in declarative VPLs, ensuring without “unreasonable” cost th...

Blending Polyhedra with Overlays

We introduce a novel method for constructing polyhedra by blending together two or more existing polyhedra, using a dualization method. The method results in a Minkowski sum, analogous to that of overlay tilings [5], which uses a topological dual operation to create tilings from a network (a graph embedded in a plane). This paper extends that method to networks on the surface of the unit sphere...

Anonymous Publish-Subscribe Overlays